Maximum matching width: New characterizations and a fast algorithm for dominating set
نویسندگان
چکیده
منابع مشابه
Maximum Matching Width: New Characterizations and a Fast Algorithm for Dominating Set
We give alternative definitions for maximum matching width, e.g. a graph G has mmw(G) ≤ k if and only if it is a subgraph of a chordal graph H and for every maximal clique X of H there exists A,B,C ⊆ X with A∪B∪C = X and |A|, |B|, |C| ≤ k such that any subset of X that is a minimal separator of H is a subset of either A,B or C. Treewidth and branchwidth have alternative definitions through inte...
متن کاملMaximum matching width : new characterizations and a 1 fast algorithm for dominating set
5 A graph of treewidth k has a representation by subtrees of a ternary tree, with sub6 trees of adjacent vertices sharing a tree node, and any tree node sharing at most k + 1 7 subtrees. Likewise for branchwidth, but with a shift to the edges of the tree rather than 8 the nodes. In this paper we show that the mm-width of a graph maximum matching 9 width combines aspects of both these representa...
متن کاملA Fast Distributed Algorithm for Approximating the Maximum Matching
We present a distributed approximation algorithm that computes in every graph G a matching M of size at least 2 3 β(G), where β(G) is the size of a maximum matching in G. The algorithm runs in O(log |V (G)|) rounds in the synchronous, message passing model of computation and matches the best known asymptotic complexity for computing a maximal matching in the same protocol. This improves the run...
متن کاملSemidefinite relaxation for dominating set
‎It is a well-known fact that finding a minimum dominating set and consequently the domination number of a general graph is an NP-complete problem‎. ‎In this paper‎, ‎we first model it as a nonlinear binary optimization problem and then extract two closely related semidefinite relaxations‎. ‎For each of these relaxations‎, ‎different rounding algorithm is exp...
متن کاملFast Algorithms for min independent dominating set
We first devise a branching algorithm that computes a minimum independent dominating set with running time O∗(1.3351n) = O∗(20.417n) and polynomial space. This improves upon the best state of the art algorithms for this problem. We then study approximation of the problem by moderately exponential time algorithms and show that it can be approximated within ratio 1 + ε, for any ε > 0, in a time s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2018
ISSN: 0166-218X
DOI: 10.1016/j.dam.2017.09.019